Some New ECIAUED Codes
نویسندگان
چکیده
منابع مشابه
An Improvement on Constructions of t-EC/AUED Codes
A common method of constructing f-error correcting/all unidirectional error detecting (t-ECIAUED) codes is to choose a t E C code and then to append a tail such that the new code can detect all unidirectional errors. The tail is a function of the weight of the codeword. We present a technique to reduce the weight distribution of the CEC code so that the tail needed will be shorter in some cases...
متن کاملOn Symmetric Error Correcting and All Unidirectional Error Detecting Codes
AbstmctThis paper considers the design of binary Mock codes that are capaMe of correcting UP to t symmetric errors and detecting all unidirectional errors. A class of systematic t symmetric-error-correctingM1-unidirectional-error-detecting (tS~ECIAUED) codes are proposed. When = o the proposed codes become Berger codes. For t = 1, the proposed codes are puts. t-symmetric-errorcorrecting/all-uni...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملOptimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998